Regularity of optimal sets for some functional involving eigenvalues of an operator in divergence form

In this paper we consider minimizers of the functional$\min \{{\lambda }_1(\mathrm{\Omega })+\cdots +{\lambda }_k(\mathrm{\Omega })+\mathrm{\Lambda }|\mathrm{\Omega }|,:\mathrm{\Omega }\subset D\text{ open}\}$ where $D\subset {\mathbb{R}}^d$ is a bounded open set and where $0<{\lambda }_1(\mathrm{\Omega })\le \cdots \le {\lambda }_k(\mathrm{\Omega })$ are the first k eigenvalues on Ω of an operator in divergence form with Dirichlet boundary condition and with Hölder continuous coefficients. We prove that the optimal sets ${\mathrm{\Omega }}^{⁎}$ have finite perimeter and that their free boundary $\partial {\mathrm{\Omega }}^{⁎}\cap D$ is composed of a regular part, which is locally the graph of a $C^{1,\alpha }$-regular function, and a singular part, which is empty if $d<d^{⁎}$, discrete if $d=d^{⁎}$ and of Hausdorff dimension at most $d-d^{⁎}$ if $d>d^{⁎}$, for some $d^{⁎}\in \{5,6,7\}$.     

Distribution dependent stochastic differential equations

Due to their intrinsic link with nonlinear Fokker-Planck equations and many other applications, distribution dependent stochastic differential equations (DDSDEs) have been intensively investigated. In this paper, we summarize some recent progresses in the study of DDSDEs, which include the correspondence of weak solutions and nonlinear Fokker-Planck equations, the well-posedness, regularity estimates, exponential ergodicity, long time large deviations, and comparison theorems.     

Optimization of heterogeneous Catalyst-assisted fatty acid methyl esters biodiesel production from Soybean oil with different Machine learning methods

There is a growing attention to the bio and renewable energies due to fast depletion of fossil fuels as well as the global warming problem. Here, we developed a modeling and simulation method by means of artificial intelligence (AI) for prediction of the bioenergy production from vegetable bean oil. AI methods are well known for prediction of complex and nonlinear process. Three distinct Adaptive Boosted models including Huber regression, LASSO, and Support Vector Regression (SVR) as well as artificial neural network (ANN) were applied in this study to predict actual yield of Fatty acid methyl esters (FAME) production. All boosted utilizing the Adaptive boosting algorithm. The important influencing parameters on the biodiesel production such as the catalyst loading (CAO/Ag, wt%) and methanol to oil (Soybean oil) molar ratio were selected as the input variables of models while the yield of FAME production was selected as output. Model hyper-parameters were tuned to maintain generality while improving prediction accuracy. The models were evaluated using three distinct metrics Mean Absolute Error (MAE), Root Mean Square Error (RMSE), and R². Error rates of 8.16780E-01, 4.43895E-01, 2.06692E + 00, and 3.92713 E-01 were obtained with the MAE metric for boosted Huber, SVR, LASSO and ANN models. On the other hand, the RMSE error of these models were about 1.092E-02, 1.015E-02, 2.669E-02, and 1.01174E-02, respectively. Finally, the R-square score were calculated for boosted Huber, boosted SVR, and boosted LASSO as 0.976, 0.990, 0.872, and 0.99702, respectively. Therefore, it can be concluded that although the boosted SVR and ANN models were better models for prediction of process efficiency in terms of error, but all algorithms had high accuracy. The optimum yield of 83.77% and 81.60% for biodiesel production were observed at optimum operating values from boosted SVR and ANN models, respectively.     

Anisotropy Effects and Observational Data on the Constraints of Evolution Dark Energy Models

We investigate cosmological dark energy models where the accelerated expansion of the universe is driven by a field with an anisotropic universe. The constraints on the parameters are obtained by maximum likelihood analysis using observational of 194 Type Ia supernovae(SNIa) and the most recent joint light-curve analysis(JLA) sample. In particular we reconstruct the dark energy equation of state parameter w(z) and the deceleration parameter q(z). We find that the best fit dynamical w(z) obtained from the 194 SNIa dataset does not cross the phantom divide line w(z) =-1 and remains above and close to w(z)≈-0.92 line for the whole redshift range 0 ≤ z ≤ 1.75 showing no evidence for phantom behavior. By applying the anisotropy effect on the ΛCDM model, the joint analysis indicates that ?_(σ0)= 0.0163 ± 0.03,with 194 SNIa, ?_(σ0)=-0.0032 ± 0.032 with 238 the SiFTO sample of JLA and ?_(σ0)= 0.011 ± 0.0117 with 1048 the SALT2 sample of Pantheon at 1σ′confidence interval. The analysis shows that by considering the anisotropy, it leads to more best fit parameters in all models with JLA SNe datasets. Furthermore, we use two statistical tests such as the usual χ_(min)~2/dof and p-test to compare two dark energy models with ΛCDM model. Finally we show that the presence of anisotropy is confirmed in mentioned models via SNIa dataset.     

A bound on the Wasserstein-2 distance between linear combinations of independent random variables

We provide a bound on a distance between finitely supported elements and general elements of the unit sphere of ${?}^2\left({\mathbb{N}}^1\right)$. We use this bound to estimate the Wasserstein-2 distance between random variables represented by linear combinations of independent random variables. Our results are expressed in terms of a discrepancy measure related to Nourdin–Peccati’s Malliavin–Stein method. The main application is towards the computation of quantitative rates of convergence to elements of the second Wiener chaos. In particular, we explicit these rates for non-central asymptotic of sequences of quadratic forms and the behavior of the generalized Rosenblatt process at extreme critical exponent.     

Linear codes associated to skew-symmetric determinantal varieties

In this article we consider linear codes coming from skew-symmetric determinantal varieties, which are defined by the vanishing of minors of a certain fixed size in the space of skew-symmetric matrices. In odd characteristic, the minimum distances of these codes are determined and a recursive formula for the weight of a general codeword in these codes is given.